Covering the Edges of a Random Graph by Cliques
نویسندگان
چکیده
The clique cover number θ1(G) of a graph G is the minimum number of cliques required to cover the edges of graph G. In this paper we consider θ1(Gn,p), for p constant. (Recall that in the random graph Gn,p, each of the ( n 2 ) edges occurs independently with probability p). Bollobás, Erdős, Spencer and West [1] proved that whp (i.e. with probability 1-o(1) as n→∞) (1− o(1))n 4(log2 n) 2 ≤ θ1(Gn,.5) ≤ cn ln lnn (lnn)2 .
منابع مشابه
Covering a graph with cuts of minimum total size
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V (G)− S. A cut-cover of G is a collection of cuts whose union is E(G) and the total size of a cut-cover is the sum of the number of edges of the cuts in the cover. The cut-cover size of a graph G, denoted by cs(G), is the minimum total size of a cut-cover of G. We give general bounds on cs(G), find...
متن کاملApproximation algorithms for the k-clique covering problems
The problem of covering edges and vertices in a graph (or in a hypergraph) was motivated by a problem arising in the context of the component assembly problem. The problem is as follows: given a graph and a clique size k, find the minimum number of k-cliques such that all edges and vertices of the graph are covered by (included in) the cliques. This paper provides a collection of approximation ...
متن کاملApproximation Algorithms for the k-Clique Covering Problem
The problem of covering edges and vertices in a graph or in a hypergraph was motivated by a problem arising in the context of component assembly problem The problem is given a graph and a clique size k nd the minimum number of k cliques such that all edges and vertices of the graph are covered by included in the cliques This paper provides a collection of approximation algorithms for various cl...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملA Markov Random Field Model for Bilevel Cutset Reconstruction
A bilevel image can be modeled by the Markov random field (MRF). Let G = (V,E) be an 8-connected graph, where V and E denote the nodes (vertices) and edges, modeling the pixels and the connectivities in an image, respectively. The MRF with 2-point cliques is defined on the 8-connected graph. The 2-point cliques consist of horizontal, vertical and diagonal neighboring nodes (Figure 1a). A node i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 15 شماره
صفحات -
تاریخ انتشار 1995